Wat (wie) is memetic algorithm - definitie

ALGORITHM

Hybrid genetic algorithm; Memetic algorithms; Memetic Computing; Hybrid Genetic Algorithm; Applications of memetic algorithms

memetic algorithm

<algorithm> A genetic algorithm or evolutionary algorithm which includes a non-genetic local search to improve genotypes. The term comes from the Richard Dawkin's term "meme". One big difference between memes and genes is that memes are processed and possibly improved by the people that hold them - something that cannot happen to genes. It is this advantage that the memetic algorithm has over simple genetic or evolutionary algorithms. These algorithms are useful in solving complex problems, such as the "Travelling Salesman Problem," which involves finding the shortest path through a large number of nodes, or in creating artificial life to test evolutionary theories. Memetic algorithms are one kind of metaheuristic. {UNLP memetic algorithms home page (http://ing.unlp.edu.ar/cetad/mos/memetic_home.html)}. (07 July 1997)

Memetic algorithm

A memetic algorithm (MA) in computer science and operations research, is an extension of the traditional genetic algorithm. It may provide a sufficiently good solution to an optimization problem.

https://en.wikipedia.org/wiki/Memetic_algorithm

Prim's algorithm

In computer science, Prim's algorithm (also known as Jarník's algorithm) is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.

https://en.wikipedia.org/wiki/Prim's_algorithm

Wikipedia

Memetic algorithm

A memetic algorithm (MA) in computer science and operations research, is an extension of the traditional genetic algorithm (GA) or more general evolutionary algorithm (EA). It may provide a sufficiently good solution to an optimization problem. It uses a suitable heuristic or local search technique to improve the quality of solutions generated by the EA and to reduce the likelihood of premature convergence.

Memetic algorithms represent one of the recent growing areas of research in evolutionary computation. The term MA is now widely used as a synergy of evolutionary or any population-based approach with separate individual learning or local improvement procedures for problem search. Quite often, MAs are also referred to in the literature as Baldwinian evolutionary algorithms (EAs), Lamarckian EAs, cultural algorithms, or genetic local search.

https://en.wikipedia.org/wiki/Memetic algorithm